Provably Secure Untraceable Electronic Cash against Insider Attacks
نویسندگان
چکیده
Although a great deal of research has been done on electronic cash schemes with blind multisignatures to prevent an insider attack, there is no discussion of a formal security model in the literature. Firstly we discussed the security model of e-cash schemes based on the blind multisignature scheme against a (restricted) attack model and proposed a concrete scheme proven to be secure in the model [1]; however, this attack model disallows an attacker from corrupting an issuing bank and shops in the forgery game. In this paper, first, we reconsider the security model to remove the restriction of the attack model. Second, we propose a new untraceable e-cash scheme with a blind multisignature scheme and prove that the proposed scheme is secure against the (non-restricted) attacks under the DDH assumption in the random oracle model. key words: blind multisignature, electronic cash, provable security, random oracle model, insider attacks
منابع مشابه
How To Break and Repair A "Provably Secure" Untraceable Payment System
On Crypto '88, an untraceable payment system with provable security against abuse by individuals was presented by Damgård. We show how to break the untraceability of that system completely. Next, an improved version of the system is presented. We also augment the system by security for the individuals against loss of money, and we introduce the possibility of receipts for payments. Finally, whe...
متن کاملTowards Provably Secure Eecient Electronic Cash (extended Abstract)
An \electronic coin scheme" as deened by Chaum, Fiat, and Naor 5] is a collection of protocols to achieve untraceable, unforgeable coins with ooine purchasing; this is the minimum set of properties to make electronic money useful. We give a new electronic coin scheme that is simple and practical. Withdrawal requires only two rounds of interaction, while purchase and deposit are non-interactive;...
متن کاملPassword-Based Group Key Exchange Secure Against Insider Guessing Attacks
Very recently, Byun and Lee suggested two provably secure group Diffie-Hellman key exchange protocols using n participant’s distinct passwords. Unfortunately, the schemes were found to be flawed by Tang and Chen. They presented two password guessing attacks such as off-line and undetectable on-line dictionary attacks by malicious insider attacker. In this paper, we present concrete countermeasu...
متن کاملA Secure ID-Based Authenticated Group Key Exchange Protocol Resistant to Insider Attacks
Recently, several identity (ID)-based authenticated group key exchange (IDAGKE) protocols from bilinear pairings were proposed. However, they all suffered from different types of insider (participants) colluding attacks. In this paper, we present a new IDAGKE protocol from bilinear pairings. In the random oracle model and under some security assumptions, we demonstrate that the proposed protoco...
متن کاملFrontiers in Insider Threats and Data Leakage Prevention
Organizations continue to be plagued by information leaks caused by insiders with legitimate access to critical or proprietary information. Such unauthorized leaks may result in significant damage to competitiveness, reputation and finances, and organizations should consider proactive approaches to preventing, detecting, and responding to this threat. In this special issue, we have selected eig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEICE Transactions
دوره 90-A شماره
صفحات -
تاریخ انتشار 2007